Types as Resources for Classical Natural Deduction
نویسندگان
چکیده
We define two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments –based on decreasing measures of type derivations– to characterize head and strongly normalizing terms. Moreover, typability provides upper bounds for the length of head-reduction sequences and maximal reduction sequences. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Strong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedd...
متن کاملIntuitionistic Letcc via Labelled Deduction
The well-known embedding of intuitionistic logic into classical modal logic means that intuitionistic logic can be viewed as a calculus of labelled deduction on multiple-conclusion sequents, where the labels are the Kripke worlds of the modal embedding. The corresponding natural deduction system constitutes a type system for programs using control operators such as letcc that capture the curren...
متن کاملTerms for Natural Deduction, Sequent Calculus and Cut Elimination in Classical Logic
This paper revisits the results of Barendregt and Ghilezan [3] and generalizes them for classical logic. Instead of λ-calculus, we use here λμ-calculus as the basic term calculus. We consider two extensionally equivalent type assignment systems for λμ-calculus, one corresponding to classical natural deduction, and the other to classical sequent calculus. Their relations and normalisation proper...
متن کاملA/z-CALCULUS: AN ALGORITHMIC INTERPRETATION OF CLASSICAL NATURAL DEDUCTION
1 INTRODUCTION This paper presents a way of extending the paradigm "proofs as programs" to classical proofs. The system we use is derived from the general Free Deduction system presented in [31. Usually when considering proofs as programs, one has only in mind some kind of intuitionistic proofs. There is an obvious reason for that restriction: only intuitionistic proofs are contructive, in the ...
متن کاملTeaching Natural Deduction as a Subversive Activity
In this paper we argue that sequent proofs systems are a better deductive apparatus for introducing proofs to students than are natural deduction systems. Natural deduction derivations of superintuitionistic theorems (theorems of classical logic that are not intuitionistically valid) require indirect and often obtuse constructions. Constructing derivations in sequent systems is uniform, driven ...
متن کامل